Acceleration of Convergence of the Alternating Least Squares Algorithm for Nonlinear Principal Components Analysis
نویسندگان
چکیده
Principal components analysis (PCA) is a popular descriptive multivariate method for handling quantitative data. In PCA of a mixture of quantitative and qualitative data, it requires quantification of qualitative data to obtain optimal scaling data and use ordinary PCA. The extended PCA including such quantification is called nonlinear PCA, see Gifi [Gifi, 1990]. The existing algorithms for nonlinear PCA are PRINCIPALS of Young et al. [Young et al., 1978] and PRINCALS of Gifi [Gifi, 1990] in which the alternating least squares (ALS) algorithm is utilized. The algorithm alternates between quantification of qualitative data and computation of ordinary PCA of optimal scaling data.
منابع مشابه
Acceleration and Re-start of the Alternating Least Squares Algorithm for Non-linear Principal Components Analysis
In principal components analysis (PCA) of mixture of quantitative and qualitative data, we require to quantify qualitative data. The alternating least squares (ALS) algorithm can be used for PCA including such quantification. However, the ALS algorithm is linear convergence and its speed is very slow in the application of PCA to very large mixed data. In order to circumvent the problem of its s...
متن کاملHarmonics Estimation in Power Systems using a Fast Hybrid Algorithm
In this paper a novel hybrid algorithm for harmonics estimation in power systems is proposed. The estimation of the harmonic components is a nonlinear problem due to the nonlinearity of phase of sinusoids in distorted waveforms. Most researchers implemented nonlinear methods to extract the harmonic parameters. However, nonlinear methods for amplitude estimation increase time of convergence. Hen...
متن کاملSuperlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis
We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...
متن کاملar X iv : 1 50 7 . 04 72 1 v 2 [ m at h . N A ] 2 1 Ju l 2 01 7 ON ACCELERATING THE REGULARIZED ALTERNATING LEAST SQUARE ALGORITHM FOR TENSORS
In this paper, we discuss the acceleration of the regularized alternating least square (RALS) algorithm for tensor approximation. We propose a fast iterative method using a AitkenStefensen like updates for the regularized algorithm. Through numerical experiments, the fast algorithm demonstrate a faster convergence rate for the accelerated version in comparison to both the standard and regulariz...
متن کاملThe Gifi System of Descriptive Multivariate Analysis
The Gifi system of analyzing categorical data through nonlinear varieties of classical multivariate analysis techniques is reviewed. The system is characterized by the optimal scaling of categorical variables which is implemented through alternating least squares algorithms. The main technique of homogeneity analysis is presented, along with its extensions and generalizations leading to nonmetr...
متن کامل